Design and numerical modeling of a pressurized airframe bulkhead joint

The structural loading on a conceptual lap joint in the empennage of a civil aircraft has been investigated. The lap joint interfaces the end-pressure part-hemispherical bulkhead to the cylindrical fuselage. The pressure bulkhead is made of carbon fiber reinforced plastic materials. The aim of the study is to present numerical results of the induced structural loading from the fuselage positive internal pressure differential and the localized high stress intensity field at the lap joint location. A methodology for the appropriate numerical approach to analyze the domed pressure bulkhead is presented. The results of the numerical investigation showed that the laminate loading levels calculated by the use of either initial sizing analytical formulas for pressurized domes or by the use of equilibrium nodal loading from finite element models of low fidelity compared to refined finite element analysis can be significantly underestimated. Some of the implications on carbon fiber reinforced plastic structural sizing at the specified location are developed

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show the rather surprising structural result that a disjoint union of cycles is the complement of a disk graph if and only if at most one of those cycles is of odd length. From that, we derive the first QPTAS and subexponential algorithm running in time 2^{O~(n^{2/3})} for Maximum Clique on disk graphs. In stark contrast, Maximum Clique on intersection graphs of filled ellipses or filled triangles is unlikely to have such algorithms, even when the ellipses are close to unit disks. Indeed, we show that there is a constant ratio of approximation which cannot be attained even in time 2^{n^{1-epsilon}}, unless the Exponential Time Hypothesis fails

On the Parameterized Complexity of Red-Blue Points Separation

We study the following geometric separation problem: Given a set R of red points and a set B of blue points in the plane, find a minimum-size set of lines that separate R from B. We show that, in its full generality, parameterized by the number of lines k in the solution, the problem is unlikely to be solvable significantly faster than the bruteforce nO(k) -time algorithm, where n is the total number of points. Indeed, we show that an algorithm running in time f(k)nᵒ(k/log k) , for any computable function f, would disprove ETH. Our reduction crucially relies on selecting lines from a set with a large number of different slopes (i.e., this number is not a function of k). Conjecturing that the problem variant where the lines are required to be axis-parallel is FPT in the number of lines, we show the following preliminary result. Separating R from B with a minimum-size set of axis-parallel lines is FPT in the size of either set, and can be solved in time O∗(9|B|) (assuming that B is the smaller set)

QPTAS and subexponential algorithm for maximum clique on disk graphs

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show the rather surprising structural result that a disjoint union of cycles is the complement of a disk graph if and only if at most one of those cycles is of odd length. From that, we derive the first QPTAS and subexponential algorithm running in time $2^{\tilde{O}(n^{2/3})}$ for \textsc{Maximum Clique} on disk graphs. In stark contrast, \textsc{Maximum Clique} on intersection graphs of filled ellipses or filled triangles is unlikely to have such algorithms, even when the ellipses are close to unit disks. Indeed, we show that there is a constant ratio of approximation which cannot be attained even in time $2^{n^{1-\varepsilon}}$, unless the Exponential Time Hypothesis fails

Micromechanical modelling and interfacial strength prediction of multidirectional laminated fibre reinforced polymers

Delamination initiation and propagation is a common failure mode in laminated composites that must be considered when assessing damage in composite structures. Delamination usually propagates at the interface between laminas. Current approved testing procedures address the inter-laminar strength in fracture modes I and II for interfaces of unidirectional laminas oriented in the same direction. The aim of this study was to investigate the interlaminar fracture initiation strength in multi-layer lamina interfaces by the use of micromechanical numerical analysis. Representative volumetric elements with randomly distributed fibres and the ability of numerically modelling fibre-matrix interfacial debonding were generated with different ply interfacial orientations. Failure initiation and damage sequences were captured and the global stresses where failure initiated were determined for the studied configurations. Insights on the variations in the strength observed due to the different lamina orientations were provided

Sensitivity of composite scarf joints to manufacturing deviation and disbond under tensile load

Scarf joints are an effective method of bonding thick composite laminates for applications such as the repair of composite aircraft structures. However, concerns remain about their damage tolerance characteristics. Typically composite scarf repairs to aircraft structures require use of hand tools or rudimentary jigs. If the scarf is incorrectly prepared, this may cause a profile deviation to the joint, affecting the bond line stresses and in turn, reducing the residual strength of the joint or repair. The subject of this work examined the sensitivity of composite scarf joints to machining profile deviation and artificial disbond, when subject to static tensile load. Tensile test specimens were prepared with two different configurations of scarf for representing an undercut or imprecise scarf typical of a machining error. In addition, sensitivity of the scarf joints in the presence of an artificial disbond was also tested. Results indicated that for the specimens tested, the scarf is relatively insensitive to minor profile deviation, but highly sensitive to an artificial disbond. Experimental results were also compared with finite element analysis

Uplink NOMA for UAV-Aided Maritime Internet-of-Things

Maritime activities are vital for economic growth, being further accelerated by various emerging maritime Internet of Things (IoT) use cases, including smart ports, autonomous navigation, and ocean monitoring systems. However, broadband, low-delay, and reliable wireless connectivity to the ever-increasing number of vessels, buoys, platforms and sensors in maritime communication networks (MCNs) has not yet been achieved. Towards this end, the integration of unmanned aerial vehicles (UAVs) in MCNs provides an aerial dimension to current deployments, relying on shore-based base stations (BSs) with limited coverage and satellite links with high latency. In this work, a maritime IoT topology is examined where direct uplink communication with a shore BS cannot be established due to excessive pathloss. In this context, we employ multiple UAVs for end-to-end connectivity, simultaneously receiving data from the maritime IoT nodes, following the non-orthogonal multiple access (NOMA) paradigm. In contrast to other UAV-aided NOMA schemes in maritime settings, dynamic decoding ordering at the UAVs is used to improve the performance of successive interference cancellation (SIC), considering the rate requirements and the channel state information (CSI) of each maritime node towards the UAVs. Moreover, the UAVs are equipped with buffers to store data and provide increased degrees of freedom in opportunistic UAV selection. Simulations reveal that the proposed opportunistic UAV-aided NOMA improves the average sum-rate of NOMA-based maritime IoT communication, leveraging the dynamic decoding ordering and caching capabilities of the UAVs